One Time, Many Times

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lecture 13 Many-time Signatures 1 One-time Signatures

Constructing a scheme that satisfies such a strong security notion is very involved, so we start with an easier goal: unforgeability under a one-time chosen-message attack (uf-1cma). The definition is syntactically identical to the one above, but F is restricted to make (at most) one query to its signing oracle. Here we describe Lamport’s one-time signature scheme OTS for messages of length ` =...

متن کامل

On ~-reducibility versus Polynomial Time Many-one Reducibility*

We prove that each element of a class of f,anctions (denoted by NPCtP), whose graphs can be accepted in nondeterministic polynomial time, can be evaluated in deterministic polynomial time if and only if '/-reducibility is equivalent to polynomial time many-one reducibility. We also modify the proof technique used to obtain part of this result to obtain the stronger result that if every ,/-reduc...

متن کامل

Polynomial-time Many-one Reductions for Petri Nets

We apply to Petri net theory the technique of polynomial-time many-one reductions. We study boundedness, reachability, deadlock , liveness problems and some of their variations. We derive three main results. Firstly, we highlight the power of expression of reachability which can polynomially give evidence of unboundedness. Secondly, we prove that reachability and deadlock are polynomially-time ...

متن کامل

One Time-traveling Bit is as Good as Logarithmically Many

We consider computation in the presence of closed timelike curves (CTCs), as proposed by Deutsch. We focus on the case in which the CTCs carry classical bits (as opposed to qubits). Previously, Aaronson and Watrous showed that computation with polynomially many CTC bits is equivalent in power to PSPACE. On the other hand, Say and Yakaryılmaz showed that computation with just 1 classical CTC bit...

متن کامل

Beyond Time - Frequency Analysis : Energy Densitiesin One and Many

| Given a unitary operator A representing a physical quantity of interest, we employ concepts from group representation theory to deene two natural signal energy densities for A. The rst is invariant to A and proves useful when the eeect of A is to be ignored; the second is covariant to A and measures the \A" content of signals. We also consider joint densities for multiple operators. In the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Millennium: Journal of International Studies

سال: 2018

ISSN: 0305-8298,1477-9021

DOI: 10.1177/0305829818801494